Implicational (semilinear) logics II: additional connectives and characterizations of semilinearity
نویسندگان
چکیده
This is the continuation of the paper [4]. We continue the abstract study of non-classical logics based on the kind of generalized implication connectives they possess and we focus on semilinear logics, i.e. those that are complete with respect to the class of models where the implication defines a linear order. We obtain general characterizations of semilinearity in terms of the intersection-prime extension property, the syntactical semilinearity metarule and the class of finitely subdirectly irreducible models. Moreover, we consider extensions of the language with lattice connectives and generalized disjunctions, study their interplay with implication and obtain axiomatizations and further descriptions of semilinear logics in terms of disjunctions and the proof by cases property.
منابع مشابه
A hierarchy of implicational (semilinear) logics: the propositional case
In Abstract Algebraic Logic the general study of propositional non-classical logics has been traditionally based on the abstraction of the Lindenbaum-Tarski process. In this kind of process one considers the Leibniz relation of indiscernible, i.e. logically equivalent, formulae. Such approach has resulted in a classification of logics partly based on generalizations of equivalence connectives: ...
متن کاملImplicational (semilinear) logics I: a new hierarchy
In Abstract Algebraic Logic, the general study of propositional non-classical logics has been traditionally based on the abstraction of the Lindenbaum-Tarski process. In this process one considers the Leibniz relation of indiscernible formulae. Such approach has resulted in a classification of logics partly based on generalizations of equivalence connectives: the Leibniz hierarchy. This paper p...
متن کاملAn Abstract Approach to Fuzzy Logics: implicational semilinear logics
This paper presents a new abstract framework to deal in a uniform way with the increasing variety of fuzzy logics studied in the literature. By means of notions and techniques from Abstract Algebraic Logic, we perform a study of non-classical logics based on the kind of generalized implication connectives they possess. It yields the new hierarchy of implicational logics. In this framework the n...
متن کاملTruth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملIntuitionistic implication makes model checking hard
We investigate the complexity of the model checking problem for intuitionistic and modal propositional logics over transitive Kripke models. More specific, we consider intuitionistic logic IPC, basic propositional logic BPL, formal propositional logic FPL, and Jankov’s logic KC. We show that the model checking problem is P-complete for the implicational fragments of all these intuitionistic log...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Arch. Math. Log.
دوره 55 شماره
صفحات -
تاریخ انتشار 2016